Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Federated learning (FL)-based object detection systems provide many advantages, such as efficiency and privacy. However, performance degradation due to the data heterogeneity issue remains a critical yet often overlooked challenge in recent FL research. In this paper, we address the data heterogeneity issue by introducing model contrastive loss, which significantly improves performance compared to baseline methods. In addition, focal loss is applied to further enhance the prediction accuracy on minority-class objects. Experimental results demonstrate the effectiveness of the proposed federated training framework, achieving approximately 20% improvement in mean average precision over the baseline FedAvg. Furthermore, extensive ablation studies on different hyperparameters in the model contrastive loss are conducted, providing deeper insights into the impact of parameter selection.more » « lessFree, publicly-accessible full text available November 1, 2026
-
Abstract In 1983, Bouchet conjectured that every flow‐admissible signed graph admits a nowhere‐zero 6‐flow. By Seymour's 6‐flow theorem, Bouchet's conjecture holds for signed graphs with all edges positive. Recently, Rollová et al proved that every flow‐admissible signed cubic graph with two negative edges admits a nowhere‐zero 7‐flow, and admits a nowhere‐zero 6‐flow if its underlying graph either contains a bridge, or is 3‐edge‐colorable, or is critical. In this paper, we improve and extend these results, and confirm Bouchet's conjecture for signed graphs with frustration number at most two, where the frustration number of a signed graph is the smallest number of vertices whose deletion leaves a balanced signed graph.more » « less
An official website of the United States government
